منابع مشابه
fragmentability and approximation
in chapter 1, charactrizations of fragmentability, which are obtained by namioka (37), ribarska (45) and kenderov-moors (32), are given. also the connection between fragmentability and its variants and other topics in banach spaces such as analytic space, the radone-nikodym property, differentiability of convex functions, kadec renorming are discussed. in chapter 2, we use game characterization...
15 صفحه اولApproximation Algorithms for Bandwidth and Storage Allocation
We discuss two NP-hard allocation problems, the Bandwidth Allocation Problem (BAP) and the Storage Allocation Problem (SAP). In BAP we are given a set of requests, each of which is associated with a time interval, a bandwidth demand, and a profit. A feasible solution is a subset of requests such that at any given time the total bandwidth given to allocated requests does not exceed the available...
متن کاملOptimal Budget Allocation for Sample Average Approximation
The sample average approximation approach to solving stochastic programs induces a sampling error, caused by replacing an expectation by a sample average, as well as an optimization error due to approximating the solution of the resulting sample average problem. We obtain estimators of an optimal solution and the optimal value of the original stochastic program after executing a finite number o...
متن کاملtight frame approximation for multi-frames and super-frames
در این پایان نامه یک مولد برای چند قاب یا ابر قاب تولید شده تحت عمل نمایش یکانی تصویر برای گروه های شمارش پذیر گسسته بررسی خواهد شد. مثال هایی از این قاب ها چند قاب های گابور، ابرقاب های گابور و قاب هایی برای زیرفضاهای انتقال پایاست. نشان می دهیم که مولد چند قاب تنک نرمال شده (ابرقاب) یکتا وجود دارد به طوری که مینیمم فاصله را از ان دارد. همچنین مسایل مشابه برای قاب های دوگان مطرح شده و برخی ...
15 صفحه اولApproximation algorithms for dynamic resource allocation
We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the activity’s subsequent state. We study the complexity of, and approximation algorithms for, maximizing average utility.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1964
ISSN: 0022-247X
DOI: 10.1016/0022-247x(64)90090-3